On the efficiency of Newton and Broyden numerical methods in the investigation of the regular polygon problem of (N + 1) bodies

نویسندگان

  • M. Gousidou-Koutita
  • T. J. Kalvouridis
چکیده

Keywords: Celestial Mechanics (N + 1)-Ring-body problem Non-linear algebraic equations Newton and quasi-Newton methods Comparison of numerical methods a b s t r a c t Numerical methods of finding the roots of a system of non-linear algebraic equations are treated in this paper. This paper attempts to give an answer to the selection of the most efficient method in a complex problem of Celestial Dynamics, the so-called ring problem of (N + 1) bodies. We apply Newton and Broyden's method to these problems and we investigate , by means of their use, the planar equilibrium points, the five equilibrium zones, which are symbolized by A 1 , A 2 , B, C 2 , and C 1 (by order of appearance from the center O to the periphery of the imaginary circle on which the primaries lie) [T.J. Kalvouridis, A pla-nar case of the N + 1 body problem: the ring problem. Astrophys. Space Sci. 260 (3) (1999) 309–325], and the attracting regions of the system. The efficiency of these methods is studied through a comparative process. The obtained results are demonstrated in figures and are discussed. In this paper, we apply two numerical methods for finding the roots of a system of non-linear algebraic equations. Although the developed methodology has traced a rather long historical path, the number of the methods that have been proposed in the course of these years is rather small. Some of them are mentioned for purely historical reasons, as for example the simple iteration method and the steepest descent one; others are difficult to apply in real problems or to be used by people who are not familiar with the sophisticated numerical analysis (see for example [2–4], etc.). Here, we must emphasize the fact, that the wide use of computational software like Matlab, Mathematica, Mapple, etc., has alienated the ordinary users from the fundamental concepts and procedures of Numerical Analysis and the relevant programming environment, and converted them to simple operators of these tools, where their personal interference is trivial. Nevertheless, this software is extremely useful since it gives solutions to many difficult problems, and a lot of complicated scientific research would not have been realized without them. Through this paper we intend to bring forward the importance of the comparative study of homologous numerical methods applicable to realistic problems. Here we note that comparison processes have been widely used in the past …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Behavior of Damped Quasi-Newton Methods for Unconstrained Optimization

We consider a family of damped quasi-Newton methods for solving unconstrained optimization problems. This family resembles that of Broyden with line searches, except that the change in gradients is replaced by a certain hybrid vector before updating the current Hessian approximation. This damped technique modifies the Hessian approximations so that they are maintained sufficiently positive defi...

متن کامل

A New High Order Closed Newton-Cotes Trigonometrically-fitted Formulae for the Numerical Solution of the Schrodinger Equation

In this paper, we investigate the connection between closed Newton-Cotes formulae, trigonometrically-fitted methods, symplectic integrators and efficient integration of the Schr¨odinger equation. The study of multistep symplectic integrators is very poor although in the last decades several one step symplectic integrators have been produced based on symplectic geometry (see the relevant lit...

متن کامل

A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

متن کامل

Using an Efficient Penalty Method for Solving Linear Least Square Problem with Nonlinear Constraints

In this paper, we use a penalty method for solving the linear least squares problem with nonlinear constraints. In each iteration of penalty methods for solving the problem, the calculation of projected Hessian matrix is required. Given that the objective function is linear least squares, projected Hessian matrix of the penalty function consists of two parts that the exact amount of a part of i...

متن کامل

Calculations of Dihedral Groups Using Circular Indexation

‎In this work‎, ‎a regular polygon with $n$ sides is described by a periodic (circular) sequence with period $n$‎. ‎Each element of the sequence represents a vertex of the polygon‎. ‎Each symmetry of the polygon is the rotation of the polygon around the center-point and/or flipping around a symmetry axis‎. ‎Here each symmetry is considered as a system that takes an input circular sequence and g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 212  شماره 

صفحات  -

تاریخ انتشار 2009